Linear Logic and Strong Normalization

Strong normalization for linear logic requires elaborated rewriting techniques. In this paper we give a new presentation of MELL proof nets, without any commutative cut-elimination rule. We show how this feature induces a compact and simple proof of strong normalization, via reducibility candidates. It is the first proof of strong normalization for MELL which does not rely on any form of confluence, and so it smoothly scales up to full linear logic. Moreover, it is an axiomatic proof, as more generally it holds for every set of rewriting rules satisfying three very natural requirements with respect to substitution, commutation with promotion, full composition, and Kesner’s IE property. The insight indeed comes from the theory of explicit substitutions, and from looking at the exponentials as a substitution device. 1998 ACM Subject Classification F.4.1 Mathematical Logic, F.3.2 Semantics of Programming Languages